Domination in bounded interval tolerance graphs
نویسنده
چکیده
In this paper we present eÆcient algorithms to solve domination set problem for the class of bounded tolerance graphs. The class of bounded tolerance graphs includes interval graphs and permtation graph as subclasses. Our solution to domination set problem has improved bounds for time complexity than the algorithm for the general co-comparability graphs which can as well be used for bounded tolerance graphs.
منابع مشابه
Complexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملOn the thinness and proper thinness of a graph
Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that graphs with bounded proper thinness generalize proper interval graphs. We study the complexity of problems related to the computation of these parameters, describe the behavior of the thinness and proper thinness under three graph operati...
متن کاملA new list scheduling method based on structural properties of task graphs
p. xiii Parallel and Multi-Computing (1) A New List Scheduling Method Based on Structural Properties of Task Graphs p. 3 A New Model of Exploiting Loop Parallelization Using Knowledge-Based Techniques p. 9 Network Based Genetic Algorithm p. 15 Parallel and Multi-Computing (2) A Memory Management Architecture for a Mobile Computing Environment p. 23 Domination in Bounded Interval Tolerance Graph...
متن کاملEfficient algorithms for Roman domination on some classes of graphs
A Roman dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2} such that every vertex x with f (x) = 0 is adjacent to at least one vertex y with f (y) = 2. The weight of a Roman dominating function is defined to be f (V ) = ∑ x∈V f (x), and the minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G. In this paper we first answer ...
متن کاملPaired domination on interval and circular-arc graphs
We study the paired-domination problem on interval graphs and circular-arc graphs. Given an interval model with endpoints sorted, we give an O(m + n) time algorithm to solve the paired-domination problem on interval graphs. The result is extended to solve the paired-domination problem on circular-arc graphs in O(m(m+ n)) time. MSC: 05C69, 05C85, 68Q25, 68R10, 68W05
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000